Summing one-loop graphs at multiparticle threshold

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Summing one-loop graphs at multiparticle threshold.

It is shown that the technique recently suggested by Lowell Brown for summing the tree graphs at threshold can be extended to calculate the loop effects. Explicit result is derived for the sum of one-loop graphs for the amplitude of threshold production of n on-mass-shell particles by one virtual in the unbroken λφ 4 theory. It is also found that the tree-level amplitude of production of n part...

متن کامل

Comment on “ Summing one - loop graphs at multi - particle threshold ”

The propagator of a virtual φ-field with emission of n on-mass-shell particles all being exactly at rest is calculated at the tree-level in λφ 4 theory by directly solving recursion equations for the sum of Feynman graphs. It is shown that the generating function for these propagators is equivalent to a Fourier transform of the recently found Green's function within the background-field techniq...

متن کامل

Multiparticle amplitudes at one-loop: an algebraic/numeric approach

The theoretical description of multi-particle production at the one-loop level is a very challenging task, as the complexity of the Feynman diagrammatic approach grows exponentially with the number of external partons. No Standard Model process which has generic 2 → 4 kinematics is computed at the one-loop level although this is highly relevant for many Higgs boson search channels at the LHC, l...

متن کامل

AdS4/CFT3 at One Loop

I consider semi-classical type IIA strings rotating in the AdS4 part of AdS4 × CP . The one loop sigma model corrections to this classical solution are used to compute the energy shift, and the result is found to be E − S = f(λ) lnS with f(λ) = √ 2λ− 5 ln 2 2π +O (

متن کامل

One Loop at a Time

Classic techniques for proving termination require the identification of a measure mapping program states to the elements of a well founded domain and to show that this measure decreases with each iteration of a loop in the program. This is a global termination condition — there is a single measure which must be shown to decrease over all of the loops in the program. In this abstract we look at...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review D

سال: 1993

ISSN: 0556-2821

DOI: 10.1103/physrevd.47.r357